Krausz dimension and its generalizations in special graph classes
نویسندگان
چکیده
In this paper we prove, that the problem ”kdim(G) ≤ 3” is polynomially solvable for chordal graphs, thus partially solving the problem of P. Hlineny and J. Kratochvil. We show, that the problem of finding m-krausz dimension is NP-hard for every m ≥ 1, even if restricted to (1,2)-colorable graphs, but the problem ”kdimm(G) ≤ k” is polynomially solvable for (∞, 1)-polar graphs for every fixed k,m ≥ 1.
منابع مشابه
Computational Complexity of the Krausz Dimension of Graphs
A Krausz partition of a graph G is a partition of the edges of G into complete subgraphs. The Krausz dimension of a graph G is the least number k such that G admits a Krausz partition in which each vertex belongs to at most k classes. The graphs with Krausz dimension at most 2 are exactly the line graphs, and graphs of the Krausz dimension at most k are intersection graphs of k-uniform linear h...
متن کاملDistance in Graphs
The distance between two vertices is the basis of the definition of several graph parameters including diameter, radius, average distance and metric dimension. These invariants are examined, especially how they relate to one another and to other graph invariants and their behaviour in certain graph classes. We also discuss characterizations of graph classes described in terms of distance or sho...
متن کاملA new characterization for Meir-Keeler condensing operators and its applications
Darbo's fixed point theorem and its generalizations play a crucial role in the existence of solutions in integral equations. Meir-Keeler condensing operators is a generalization of Darbo's fixed point theorem and most of other generalizations are a special case of this result. In recent years, some authors applied these generalizations to solve several special integral equations and some of the...
متن کاملCharacterization of projective special linear groups in dimension three by their orders and degree patterns
The prime graph $Gamma(G)$ of a group $G$ is a graph with vertex set $pi(G)$, the set of primes dividing the order of $G$, and two distinct vertices $p$ and $q$ are adjacent by an edge written $psim q$ if there is an element in $G$ of order $pq$. Let $pi(G)={p_{1},p_{2},...,p_{k}}$. For $pinpi(G)$, set $deg(p):=|{q inpi(G)| psim q}|$, which is called the degree of $p$. We also set $D(G):...
متن کاملBeyond Log-Supermodularity: Lower Bounds and the Bethe Partition Function
A recent result has demonstrated that the Bethe partition function always lower bounds the true partition function of binary, logsupermodular graphical models. We demonstrate that these results can be extended to other interesting classes of graphical models that are not necessarily binary or log-supermodular: the ferromagnetic Potts model with a uniform external field and its generalizations a...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Discrete Mathematics & Theoretical Computer Science
دوره 15 شماره
صفحات -
تاریخ انتشار 2013